Analysis of digital tries with Markovian dependency
نویسندگان
چکیده
منابع مشابه
Analysis of digital tries with Markovian dependency
W. Szpankowski* Department of Computer Science Purdue University W. Lafayette. IN 47907 USA Digital tries occur in a variety of computer and communication algorithms including symbolic manipulations, compiling, comparison based searching and sorting, digital retrieval techniques, algorilhms on strings, file systems. codes and communication protocols. It is crucial for all of these applications ...
متن کاملAnalysis of random LC tries
LC tries were introduced by Andersson and Nilsson in 1993. They are compacted versions of tries or patricia tries in which, from the top down, maximal height complete subtrees are level compressed. Andersson and Nilsson (1993) showed that for i.i.d. uniformly distributed input strings, the expected depth of the LC patricia trie is (log n). In this paper, we reene and extend this result. We anal...
متن کاملA Limit Theorem for Radix Sort and Tries with Markovian Input
Tries are among the most versatile and widely used data structures on words. In particular, they are used in fundamental sorting algorithms such as radix sort which we study in this paper. While the performance of radix sort and tries under a realistic probabilistic model for the generation of words is of significant importance, its analysis, even for simplest memoryless sources, has proved dif...
متن کاملUnsupervised Morphological Analysis Using Tries
This article presents an unsupervised morphological analysis algorithm to segment words into roots and affixes. The algorithm relies on word occurrences in a given dataset. Target languages are English, Finnish, and Turkish, but the algorithm can be used to segment any word from any language given the wordlists acquired from a corpus consisting of words and word occurrences. In each iteration, ...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1991
ISSN: 0018-9448
DOI: 10.1109/18.133271